0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : fo
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-ho \
0.00/0.00	  --no-avatar \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2 \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n111.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 17:11:11 CST 2018
0.00/0.20	% done 9 iterations in 0.004s
0.00/0.20	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.20	% SZS output start Refutation
0.00/0.20	tff(powersetAx, axiom,
0.00/0.20	  (powersetAx <=>
0.00/0.20	   (![A,B]: (in(B,powerset(A)) <=> (![Xx]: (in(Xx,B) => in(Xx,A))))))).
0.00/0.20	tff('0', plain,
0.00/0.20	    ![X0, X1]: (in(sk_Xx1(X0, X1), X0) | in(X0, powerset(X1)) | ~ powersetAx),
0.00/0.20	    inference('cnf', [status(esa)], [powersetAx])).
0.00/0.20	tff(powersetI, conjecture,
0.00/0.20	  (powersetAx =>
0.00/0.20	   (![A,B]: ((![Xx]: (in(Xx,B) => in(Xx,A))) => in(B,powerset(A)))))).
0.00/0.20	tff(zf_stmt_0, negated_conjecture,
0.00/0.20	  (~
0.00/0.20	    (powersetAx =>
0.00/0.20	     (![A,B]: ((![Xx]: (in(Xx,B) => in(Xx,A))) => in(B,powerset(A))))))).
0.00/0.20	tff('1', plain, powersetAx, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('2', plain,
0.00/0.20	    ![X0, X1]: (in(sk_Xx1(X0, X1), X0) | in(X0, powerset(X1)) | ~ $true),
0.00/0.20	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.20	tff('3', plain, ![X0, X1]: (in(X0, powerset(X1)) | in(sk_Xx1(X0, X1), X0)),
0.00/0.20	    inference('simplify', [status(thm)], ['2'])).
0.00/0.20	tff('4', plain, ![X5]: (in(X5, sk_A1) | ~ in(X5, sk_B1)),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('5', plain,
0.00/0.20	    ![X0]: (~ $true | in(sk_B1, powerset(X0)) | in(sk_Xx1(sk_B1, X0), sk_A1)),
0.00/0.20	    inference('sup-', [status(thm)], ['3', '4'])).
0.00/0.20	tff('6', plain,
0.00/0.20	    ![X0]: (in(sk_Xx1(sk_B1, X0), sk_A1) | in(sk_B1, powerset(X0))),
0.00/0.20	    inference('simplify', [status(thm)], ['5'])).
0.00/0.20	tff('7', plain,
0.00/0.20	    ![X0, X1]:
0.00/0.20	      (~ in(sk_Xx1(X0, X1), X1) | in(X0, powerset(X1)) | ~ powersetAx),
0.00/0.20	    inference('cnf', [status(esa)], [powersetAx])).
0.00/0.20	tff('8', plain,
0.00/0.20	    ![X0, X1]: (~ in(sk_Xx1(X0, X1), X1) | in(X0, powerset(X1)) | ~ $true),
0.00/0.20	    inference('demod', [status(thm)], ['7', '1'])).
0.00/0.20	tff('9', plain, ![X0, X1]: (in(X0, powerset(X1)) | ~ in(sk_Xx1(X0, X1), X1)),
0.00/0.20	    inference('simplify', [status(thm)], ['8'])).
0.00/0.20	tff('10', plain,
0.00/0.20	    (~ $true | in(sk_B1, powerset(sk_A1)) | in(sk_B1, powerset(sk_A1))),
0.00/0.20	    inference('sup-', [status(thm)], ['6', '9'])).
0.00/0.20	tff('11', plain, in(sk_B1, powerset(sk_A1)),
0.00/0.20	    inference('simplify', [status(thm)], ['10'])).
0.00/0.20	tff('12', plain, ~ in(sk_B1, powerset(sk_A1)),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('13', plain, ~ $true, inference('sup-', [status(thm)], ['11', '12'])).
0.00/0.20	tff('14', plain, $false, inference('simplify', [status(thm)], ['13'])).
0.00/0.20	
0.00/0.20	% SZS output end Refutation
0.00/0.20	EOF
